Designing tree-structured organizations for computational agents

Designing tree-structured organizations for computational agents

We describe a framework for defining the space of organization designs for computational agents, use our framework for analyzing the expected performance of a class of organizations, and describe how our analyses can be applied to predict performance for a distributed information gathering task. Our analysis specifically addresses the impact of the span of control (branching factor) in tree-str...

Chapter X. Designing Organizations for Computational Agents

Organizing is important in computational systems, just as it is important in human systems. Organizational knowledge allows a computational system to recognize its role, and the roles of others, in accomplishing collective goals. However, as circumstances change, often organizational structures must change also. It is therefore important to understand how different organizations can be designed...

Designing Solvable Graphs for Multiple Moving Agents

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

Designing Organizations

On the Computational Complexity of Designing Bounded Agents

In this paper, we determine the computational complexity of the agent design problem for several classes of bounded agents. Agent design is the problem of determining, for a given representation of an environment and representation of a task to be carried out in this environment, whether it is possible to construct an agent that can be guaranteed to accomplish the task in the environment. Previ...